Packing Planning and Execution Considering Arrangement Rules
نویسندگان
چکیده
منابع مشابه
Learning Situation-Dependent Rules: Improving Planning from Robot Execution
Real world robot tasks are so complex that it is hard to hand-tune all of the domain knowledge, especially to model the dynamics of the environment. In this paper we present techniques for learning from real-world robot execution to improve planning and execution performance. We present our work learning from execution to improve a task planner's performance. Our system collects execution trace...
متن کاملRules Governing Punishment Execution on Crime of Twin Ties in Iranian Law and Imamiyeh Jurisprudence
One of the challenging issues in the principles of jurisprudence and especially the rights of Iran, the question of the possibility or impossibility of carrying out the punishment on crimes committed by twin attached to this issue on two axes: the possibility or impossibility of separating them in terms of ordering the separation of the Clinging can be done. The findings have shown that, first...
متن کاملScheduling parallel execution of planning and action for a mobile robot considering planning cost and vision uncertainty
This paper proposes a novel method of scheduling parallel execution of planning and action for a visionmotion planning problem. A planning process can be viewed as a process of gradually reducing the plan candidates towards the final commitment to one plan. Using criteria on deciding if an action sequence is consistent with the remaining plan candidates (consistency criterion), and on when to c...
متن کاملRobust Periodic Planning and Execution
The New Millennium Remote Agent (NMRA) will be the first on-board AI svstem to control an actual spacecraft. The ~pacecraft domain raises a number of challenges for planning and execution, ranging from extended agency and long-term planning to dynamic recoveries and robust concurrent execution, all in the presence of tight real-time deadlines, changing goals, scarce resource constraints, and a ...
متن کاملConstraint Handling Rules and Tabled Execution
Both Constraint Handling Rules (CHR) and tabling as implemented in XSB are powerful enhancements of Prolog systems, based on fix point computation. Until now they have only been implemented in separate systems. This paper presents the work involved in porting a CHR system to XSB and in particular the technical issues related to the integration of CHR with tabled resolution. These issues include...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robotic Computing
سال: 2021
ISSN: 2641-9521
DOI: 10.35708/rc1870-126263